A Parallel Minimum Distance Error{correcting Context{free Parser
نویسنده
چکیده
In this paper we present the rst parallel minimumdistance error{correcting parser for context{free languages. The error correction is performed considering three kinds of syntax errors: the mutation of a symbol in another incorrect symbol, the insertion of an extraneous symbol and the deletion of a symbol. Our algorithm has the same parallel complexity of other well{known non{correcting context{free parsers such as developed in Ruz80, GR88]. Further, with respect to these algorithms it has the advantage of working with every context{free grammar and not just with grammars in Chomsky Normal Form. The algorithm is developed using dynamic programming techniques.
منابع مشابه
An Error Correcting Parser for Context Free Grammars that Takes Less Than Cubic Time
The problem of parsing has been studied extensively for various formal grammars. Given an input string and a grammar, the parsing problem is to check if the input string belongs to the language generated by the grammar. A closely related problem of great importance is one where the input are a string I and a grammar G and the task is to produce a string I ′ that belongs to the language generate...
متن کامل1 Are Efficient Natural Language Parsers Robust ?
This paper discusses the robustness of four efficient syntactic error-correcting parsing algorithms that are based on chart parsing with a context-free grammar. In this context, by robust we mean able to correct detectable syntactic errors. We implemented four versions of a bottom-up error-correcting chart parser: a basic bottom-up chart parser, and chart parsers employing selectivity, top-down...
متن کاملSome Topics in Parser Generation
An algorithm has been developed that generates an error-correcting recursive-descent syntax analyzer (parser) with no backtrack from an extended context-free grammar. A program, LLGEN, has been written to implement this algorithm. The paper discusses three aspects of the algorithm: the support of separate compilation, the mechanism for the static or dynamic resolving of conflicts, and the error...
متن کاملOn the Estimation of Error-Correcting Parameters
Error-Correcting (EC) techniques allow for coping with divergences in pattern strings with regard to their “standard” form as represented by the languageL accepted by a regular or context-free grammar. There are two main types of EC parsers: minimum-distance and stochastic. The latter apply the maximum likelihood rule: classification into the classes of the strings in L that have the greatest p...
متن کاملStudying impressive parameters on the performance of Persian probabilistic context free grammar parser
In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...
متن کامل